A note on coloring sparse random graphs
نویسنده
چکیده
Coja-Oghlan and Taraz (2004) presented a graph coloring algorithm that has expected linear running time for random graphs with edge probability p satisfying np ≤ 1.01. In this work, we develop their analysis by exploiting generating function techniques. We show that, in fact, their algorithm colors Gn,p with the minimal number of colors and has expected linear running time, provided that np ≤ 1.33.
منابع مشابه
A GRASP for Coloring Sparse Graphs
We first present a literature review of heuristics and metaheuristics developed for the problem of coloring graphs. We then present a Greedy Randomized Adaptive Search Procedure (GRASP) for coloring sparse graphs. The procedure is tested on graphs of known chromatic number, as well as random graphs with edge probability 0.1 having from 50 to 500 vertices. Empirical results indicate that the pro...
متن کاملAsymptotic behaviour of the complexity of coloring sparse random graphs∗
The behaviour of a backtrack algorithm for graph coloring is well understood for large random graphs with constant edge density. However, sparse graphs, in which the edge density decreases with increasing graph size, are more common in practice. Therefore, in this paper we analyze the expected runtime of a usual backtrack search to color such random graphs, when the size of the graph tends to i...
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملRandomly coloring sparse random graphs with fewer colors than the maximum degree
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree log n/ log log n, with high probability. We efficiently generate a random k-coloring when k = Ω(log log n/ log log log n), i.e., with many fewer colors than the maximum degree. Previous results hold for a more general class of graphs, but...
متن کاملWeighted Coloring on P4-sparse Graphs
Given an undirected graph G = (V, E) and a weight function w : V → R, a vertex coloring of G is a partition of V into independent sets, or color classes. The weight of a vertex coloring of G is defined as the sum of the weights of its color classes, where the weight of a color class is the weight of a heaviest vertex belonging to it. In the W C problem, we want to determine the mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009